Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
a(f,a(f,x)) |
→ a(x,g) |
| 2: |
|
a(x,g) |
→ a(f,a(g,a(f,x))) |
|
There are 4 dependency pairs:
|
| 3: |
|
A(f,a(f,x)) |
→ A(x,g) |
| 4: |
|
A(x,g) |
→ A(f,a(g,a(f,x))) |
| 5: |
|
A(x,g) |
→ A(g,a(f,x)) |
| 6: |
|
A(x,g) |
→ A(f,x) |
|
The approximated dependency graph contains one SCC:
{3,4,6}.
-
Consider the SCC {3,4,6}.
The constraints could not be solved.
Tyrolean Termination Tool (0.02 seconds)
--- May 4, 2006